Analysis of Elementary Cellular Automata Chaotic Rules Behavior
نویسندگان
چکیده
منابع مشابه
Analysis of Elementary Cellular Automata Chaotic Rules Behavior
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters...
متن کاملComplex Dynamics of Elementary Cellular Automata Emerging from Chaotic Rules
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order and chaotic systems. A number of attempts have been made to classify CA functions on their space-time dynamics and to predict behaviour of any given function....
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملChaotic behavior in the disorder cellular automata
Disordered cellular automata (DCA) represent an intermediate class between elementary cellular automata and the Kauffman network. Recently, Rule 126 of DCA has been explicated: the system can be accurately described by a discrete probability function. However, a means of extending to other rules has not been developed. In this investigation, a density map of the dynamical behavior of DCA is for...
متن کاملElementary Cellular Automata with Elementary Memory Rules in Cells: The Case of Linear Rules
Cellular Automata (CA) are discrete, spatially explicit extended dynamic systems. A CA system is composed of adjacent cells or sites arranged as a regular d-dimensional lattice, which evolves in discrete time steps. Each cell is characterized by an internal state whose value belongs to a finite set. The updating of these states is made simultaneously according to a common local transition rule ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Security, Privacy and Trust Management
سال: 2013
ISSN: 2319-4103,2277-5498
DOI: 10.5121/ijsptm.2013.2601